Lambek calculus is NP-complete
نویسنده
چکیده
We prove that for both the Lambek calculus L and the Lambek calculus allowing empty premises L∗ the derivability problem is NP-complete. It follows that also for the multiplicative fragments of cyclic linear logic and noncommutative linear logic the derivability problem is NP-complete.
منابع مشابه
The Lambek-Grishin Calculus Is NP-Complete
The Lambek-Grishin calculus LG is the symmetric extension of the non-associative Lambek calculus NL. In this paper we prove that the derivability problem for LG is NP-complete.
متن کاملProduct-Free Lambek Calculus Is NP-Complete
In this paper we prove that the derivability problems for productfree Lambek calculus and product-free Lambek calculus allowing empty premises are NP-complete. Also we introduce a new derivability characterization for these calculi.
متن کاملParsing for Semidirectional Lambek Grammar is NP-Complete
We study the computational complexity of the parsing problem of a variant of Lambek Categorial Grammar that we call semidirectional. In semidirectional Lambek calculus SDL there is an additional nondirectional abstraction rule allowing the formula abstracted over to appear anywhere in the premise sequent’s left-hand side, thus permitting non-peripheral extraction. SDL grammars are able to gener...
متن کاملComplexity of the Lambek Calculus and Its Fragments
• The Lambek calculus (denoted L) is a mathematical tool for formal language specification. It generates the class of all context-free languages without the empty word. • The Lambek calculus with empty antecedents (denoted L∗) generates the class of all context-free languages. • Proof nets provide a convenient criterion for derivability in L∗. • The derivability problems for L∗(\, /) and L(\, /...
متن کاملConjunctive Categorial Grammars
Basic categorial grammars are enriched with a conjunction operation, and it is proved that the formalism obtained in this way has the same expressive power as conjunctive grammars, that is, context-free grammars enhanced with conjunction. It is also shown that categorial grammars with conjunction can be naturally embedded into the Lambek calculus with conjunction and disjunction operations. Thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 357 شماره
صفحات -
تاریخ انتشار 2006